Goppa goemetry codes via elementary methods (In Portuguese)
نویسنده
چکیده
The central objective of this dissertation was to present the Goppa Geometry Codes via elementary methods which were introduced by J.H. van Lint, R.Pellikaan and T. Høhold about 1998. On the first part of such dissertation are presented the fundamental concepts about fields of rational functions of an algebraic curve in the direction as to define the Goppa Codes on a classical manner. In this study we based ourselves mainly on the book “Algebraic Function Fields and Codes” of H. Stichtenoth. The second part is initiated with an introduction about the functions weight, degree and order which are fundamental for the study of the Goppa Codes through elementary methods of linear algebra and of semigroups and such study was based on “Algebraic Geometry Codes” of J.H. van Lint, R.Pellikaan and T. Høhold. The dissertation ends up with a presentation of examples which illustrate the elementary methods that we have referred to above.
منابع مشابه
Systematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes
Any linear code with a nontrivial automorphism has the structure of a module over a polynomial ring. The theory of Griihner bases for modules gives a compact description and implementation of a systematic encoder. We present examples of algebraic-geometric Goppa codes that can be encoded by these methods, including the one-point Hermitian codes. Index TermsSystematic encoding, algebraic-geometr...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملGenerating Goppa Codes
Once quantum computers become operational all current public key crypto systems, PKCSs become obsolete. Fortunately, there are alternative quantum computer robust methods based on coding, on hashing, on multivariate polynomials, on lattices etc. One such candidate is the McEliece PKCS which is based on error correcting codes, e.g. Goppa codes. Hence, in order to implement the McEliece PKCS one ...
متن کاملOn the existence of order functions
The notions of well-behaving sequences and order funtions is fundamental in the elementary treatment of geometric Goppa codes. The existence of order functions is proved with the theory of Gröbner bases.
متن کاملGoppa codes
Absfruct-Goppa described a new class of linear noncyclic errorcorrecting codes in [l] and [2]. This paper is a summary of Goppa’s work, which is not yet available in English.’ We prove the four most important properties of Goppa codes. 1) There exist q-ary Goppa codes with lengths and redundancies comparable to BCH codes. For the same redundancy, the Goppa code is typically one digit longer. 2)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1204.1559 شماره
صفحات -
تاریخ انتشار 2012